Protein Sequence Comparison Method Based on 3-ary Huffman Coding

نویسندگان

چکیده

Based on 3-ary Huffman coding algorithm, we propose a digital mapping method of protein sequence. Firstly, tree is defined by the frequency characteristic 20 amino acids in given sequences. The 0-2 codes constructed can convert long sequences into one-to-one According to and distribution information sequences, design 40-dimensional vectors characterize Next, proposed used perform three separate applications, similarity comparison nine ND6 proteins, evolutionary trend analysis 2009 pandemic Human influenza A (H1N1) viruses from January 2020 June 2022, evolution 95 coronavirus genes. results illustrate utility method.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Fano-Huffman Based Statistical Coding Method

Statistical coding techniques have been used for lossless statistical data compression, applying methods such as Ordinary, Shannon, Fano, Enhanced Fano, Huffman and Shannon-Fano-Elias coding methods. A new and improved coding method is presented, the Fano-Huffman Based Statistical Coding Method. It holds the advantages of both the Fano and Huffman coding methods. It is more easily applicable th...

متن کامل

Twenty (or so) Questions: D-ary Bounded-Length Huffman Coding

The game of Twenty Questions has long been used to illustrate binary source coding. Recently, a physical device has been developed that mimics the process of playing Twenty Questions, with the device supplying the questions and the user providing the answers. However, this game differs from Twenty Questions in two ways: Answers need not be only “yes” and “no,” and the device continues to ask qu...

متن کامل

Huffman-Based Test Response Coding

Test compression / decompression is an efficient method for reducing the test application cost. In this letter we propose a response compression method based on Huffman coding. The proposed method guarantees zero-aliasing and it is independent of the fault model and the structure of a circuit-under-test. Experimental results of the compression ratio and the size of the encoder for the proposed ...

متن کامل

Huffman Modeling for DCT Based Coding

In this paper we present a statistical modeling for DCT events frequency distribution for three images classes: landscape, portrait and document. We show that it is possible to fit a mathematical model capturing the underlying statistical distribution. This modeling allows us to automatically generate optimized Huffman tables for each quality factor involved in the compression engine.

متن کامل

Quantum-inspired Huffman Coding

ABSTRACT Huffman Compression, also known as Huffman Coding, is one of many compression techniques in use today. The two important features of Huffman coding are instantaneousness that is the codes can be interpreted as soon as they are received and variable length that is a most frequent symbol has length smaller than a less frequent symbol. The traditional Huffman coding has two procedures: co...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Match

سال: 2023

ISSN: ['0340-6253']

DOI: https://doi.org/10.46793/match.90-2.357q